________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:21:20
Input Data from:  dataset116.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :10
Ex.Facilities   :2
Total budget    :20000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,1305
Average f[i]   :4700
Average g[i,j] :2062,5
Total demand   :11570
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 9
> Selected Move:	1610	1	-1	2	4500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0    >new incumb.: 1610


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 29
> Selected Move:	2190	1	-1	3	11000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0    >new incumb.: 2190


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 29
> Selected Move:	3400	1	-1	4	17500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0    >new incumb.: 3400


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 30
> Selected Move:	3400	3	2	9	19500


> New Y[]: 
	
	 2  3  0  1  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 31
> Selected Move:	3400	3	4	6	19500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 30
> Selected Move:	3400	3	9	2	17500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 29
> Selected Move:	3230	3	0	7	19700


> New Y[]: 
	
	 0  3  1  1  0  0  1  2  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 25
> Selected Move:	3230	4	7	2	20000


> New Y[]: 
	
	 0  3  2  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 27
> Selected Move:	3230	4	2	3	18900


> New Y[]: 
	
	 0  3  1  2  0  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 27
> Selected Move:	3230	4	3	6	18300


> New Y[]: 
	
	 0  3  1  1  0  0  2  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 28
> Selected Move:	3110	3	6	4	18300


> New Y[]: 
	
	 0  3  1  1  2  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 30
> Selected Move:	3110	4	4	2	20000


> New Y[]: 
	
	 0  3  2  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 28
> Selected Move:	3110	4	2	3	18900


> New Y[]: 
	
	 0  3  1  2  1  0  0  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 28
> Selected Move:	3110	4	3	7	19700


> New Y[]: 
	
	 0  3  1  1  1  0  0  2  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 25
> Selected Move:	3110	3	7	5	19900


> New Y[]: 
	
	 0  3  1  1  1  2  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 25
> Selected Move:	3110	4	5	3	19400


> New Y[]: 
	
	 0  3  1  2  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 26
> Selected Move:	3110	4	3	4	18800


> New Y[]: 
	
	 0  3  1  1  2  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 29
> Selected Move:	3110	3	4	6	18800


> New Y[]: 
	
	 0  3  1  1  0  1  2  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 25
> Selected Move:	3110	4	6	3	19400


> New Y[]: 
	
	 0  3  1  2  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 23
> Selected Move:	3110	4	3	5	19900


> New Y[]: 
	
	 0  3  1  1  0  2  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 21
> Selected Move:	3010	3	6	8	18400


> New Y[]: 
	
	 0  3  1  1  0  2  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 27
> Selected Move:	3230	3	5	0	16000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 31
> Selected Move:	3230	3	1	6	18300


> New Y[]: 
	
	 2  0  1  1  0  0  3  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 25
> Selected Move:	3230	4	6	3	18200


> New Y[]: 
	
	 2  0  1  3  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 25
> Selected Move:	3230	4	3	8	19300


> New Y[]: 
	
	 2  0  1  1  0  0  1  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 22
> Selected Move:	3068	4	8	2	20400


> New Y[]: 
	
	 2  0  3  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 19
> Selected Move:	3230	3	2	9	19800


> New Y[]: 
	
	 2  0  0  1  0  0  1  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 23
> Selected Move:	3151	4	9	3	20200


> New Y[]: 
	
	 2  0  0  3  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 20
> Selected Move:	3113	4	3	6	20300


> New Y[]: 
	
	 2  0  0  1  0  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 21
> Selected Move:	3230	3	6	1	18000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 36
> Selected Move:	2870	3	9	5	17500


> New Y[]: 
	
	 2  3  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 36
> Selected Move:	3070	3	8	4	19000


> New Y[]: 
	
	 2  3  0  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 34
> Selected Move:	3110	3	5	7	18500


> New Y[]: 
	
	 2  3  0  1  1  0  0  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 34
> Selected Move:	3170	3	4	6	18500


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 35
> Selected Move:	3070	3	7	5	19000


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 29
> Selected Move:	2933	3	0	2	20500


> New Y[]: 
	
	 0  3  2  1  0  1  1  0  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 26
> Selected Move:	3010	3	6	8	19000


> New Y[]: 
	
	 0  3  2  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 27
> Selected Move:	3010	4	2	3	17900


> New Y[]: 
	
	 0  3  1  2  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 30
> Selected Move:	3010	4	3	8	19400


> New Y[]: 
	
	 0  3  1  1  0  1  0  0  2  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 28
> Selected Move:	2890	3	5	7	18900


> New Y[]: 
	
	 0  3  1  1  0  0  0  1  2  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 32
> Selected Move:	2890	4	8	2	18500


> New Y[]: 
	
	 0  3  2  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 31
> Selected Move:	2890	4	2	3	17400


> New Y[]: 
	
	 0  3  1  2  0  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 30
> Selected Move:	2990	3	1	6	19700


> New Y[]: 
	
	 0  0  1  2  0  0  3  1  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 23
> Selected Move:	2990	4	3	6	19000


> New Y[]: 
	
	 0  0  1  3  0  0  2  1  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 25
> Selected Move:	3010	3	7	5	19500


> New Y[]: 
	
	 0  0  1  3  0  1  2  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 21
> Selected Move:	3010	4	3	5	19500


> New Y[]: 
	
	 0  0  1  1  0  3  2  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 22
> Selected Move:	2990	3	5	7	19300


> New Y[]: 
	
	 0  0  1  1  0  0  2  3  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 26
> Selected Move:	2990	4	6	3	19900


> New Y[]: 
	
	 0  0  1  2  0  0  1  3  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 22
> Selected Move:	2981	3	7	5	20100


> New Y[]: 
	
	 0  0  1  2  0  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 18
> Selected Move:	2953	4	5	6	20200


> New Y[]: 
	
	 0  0  1  2  0  1  3  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 19
> Selected Move:	2814	4	3	5	20700


> New Y[]: 
	
	 0  0  1  1  0  2  3  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 16
> Selected Move:	2853	3	5	7	20500


> New Y[]: 
	
	 0  0  1  1  0  0  3  2  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 21
> Selected Move:	2890	3	6	1	18200


> New Y[]: 
	
	 0  3  1  1  0  0  0  2  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 27
> Selected Move:	2837	3	2	9	20200


> New Y[]: 
	
	 0  3  0  1  0  0  0  2  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 54 #######################


> Neighbours evaluated; 26
> Selected Move:	2890	4	7	3	19400


> New Y[]: 
	
	 0  3  0  2  0  0  0  1  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 55 #######################


> Neighbours evaluated; 28
> Selected Move:	2983	3	8	6	20900


> New Y[]: 
	
	 0  3  0  2  0  0  1  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 56 #######################


> Neighbours evaluated; 21
> Selected Move:	3146	4	3	6	20300


> New Y[]: 
	
	 0  3  0  1  0  0  2  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 57 #######################


> Neighbours evaluated; 25
> Selected Move:	3025	3	6	4	20300


> New Y[]: 
	
	 0  3  0  1  2  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 58 #######################


> Neighbours evaluated; 27
> Selected Move:	2878	4	4	9	20800


> New Y[]: 
	
	 0  3  0  1  1  0  0  1  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 59 #######################


> Neighbours evaluated; 24
> Selected Move:	2994	3	4	6	20800


> New Y[]: 
	
	 0  3  0  1  0  0  1  1  0  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 60 #######################


> Neighbours evaluated; 24
> Selected Move:	2890	3	6	8	19300


> New Y[]: 
	
	 0  3  0  1  0  0  0  1  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 61 #######################


> Neighbours evaluated; 25
> Selected Move:	2940	3	7	5	19800


> New Y[]: 
	
	 0  3  0  1  0  1  0  0  1  2 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 62 #######################


> Neighbours evaluated; 24
> Selected Move:	2940	4	9	3	19900


> New Y[]: 
	
	 0  3  0  2  0  1  0  0  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 63 #######################


> Neighbours evaluated; 26
> Selected Move:	2820	3	5	2	18400


> New Y[]: 
	
	 0  3  1  2  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 64 #######################


> Neighbours evaluated; 31
> Selected Move:	2820	4	3	2	19500


> New Y[]: 
	
	 0  3  2  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,325

## ITERATION 65 #######################


> Neighbours evaluated; 29
> Selected Move:	2820	4	2	8	19900


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  2  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,32

## ITERATION 66 #######################


> Neighbours evaluated; 29
> Selected Move:	2820	4	8	9	18300


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  1  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  1  0 
 > pw :0,315

## ITERATION 67 #######################


> Neighbours evaluated; 27
> Selected Move:	2820	3	8	4	19800


> New Y[]: 
	
	 0  3  1  1  1  0  0  0  0  2 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 68 #######################


> Neighbours evaluated; 30
> Selected Move:	2820	4	9	3	19900


> New Y[]: 
	
	 0  3  1  2  1  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 69 #######################


> Neighbours evaluated; 31
> Selected Move:	2836	3	2	7	20900


> New Y[]: 
	
	 0  3  0  2  1  0  0  1  0  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 70 #######################


> Neighbours evaluated; 25
> Selected Move:	2650	3	9	5	20400


> New Y[]: 
	
	 0  3  0  2  1  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 71 #######################


> Neighbours evaluated; 29
> Selected Move:	2770	4	3	4	19800


> New Y[]: 
	
	 0  3  0  1  2  1  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 72 #######################


> Neighbours evaluated; 28
> Selected Move:	2808	3	7	9	20800


> New Y[]: 
	
	 0  3  0  1  2  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 73 #######################


> Neighbours evaluated; 27
> Selected Move:	2820	3	5	2	19300


> New Y[]: 
	
	 0  3  1  1  2  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 74 #######################


> Neighbours evaluated; 28
> Selected Move:	2820	3	4	6	19300


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 75 #######################


> Neighbours evaluated; 30
> Selected Move:	2820	4	6	3	19900


> New Y[]: 
	
	 0  3  1  2  0  0  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 76 #######################


> Neighbours evaluated; 28
> Selected Move:	2820	4	3	9	19800


> New Y[]: 
	
	 0  3  1  1  0  0  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 77 #######################


> Neighbours evaluated; 27
> Selected Move:	2700	3	3	4	19800


> New Y[]: 
	
	 0  3  1  0  1  0  1  0  0  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1 
 > pw :0,26

## ITERATION 78 #######################


> Neighbours evaluated; 29
> Selected Move:	2700	4	9	4	19300


> New Y[]: 
	
	 0  3  1  0  2  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1 
 > pw :0,255

## ITERATION 79 #######################


> Neighbours evaluated; 28
> Selected Move:	2700	4	4	6	19300


> New Y[]: 
	
	 0  3  1  0  1  0  2  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1 
 > pw :0,25

## ITERATION 80 #######################


> Neighbours evaluated; 29
> Selected Move:	2700	3	9	3	19300


> New Y[]: 
	
	 0  3  1  1  1  0  2  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 81 #######################


> Neighbours evaluated; 27
> Selected Move:	2814	3	1	7	20800


> New Y[]: 
	
	 0  0  1  1  1  0  2  3  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 82 #######################


> Neighbours evaluated; 23
> Selected Move:	2890	4	7	3	20500


> New Y[]: 
	
	 0  0  1  3  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 83 #######################


> Neighbours evaluated; 24
> Selected Move:	2893	4	6	4	20500


> New Y[]: 
	
	 0  0  1  3  2  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 84 #######################


> Neighbours evaluated; 24
> Selected Move:	2872	4	3	6	20600


> New Y[]: 
	
	 0  0  1  1  2  0  3  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 85 #######################


> Neighbours evaluated; 25
> Selected Move:	2830	4	4	6	20800


> New Y[]: 
	
	 0  0  1  1  3  0  2  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 86 #######################


> Neighbours evaluated; 21
> Selected Move:	2967	3	4	8	20100


> New Y[]: 
	
	 0  0  1  1  0  0  2  1  3  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 87 #######################


> Neighbours evaluated; 25
> Selected Move:	2869	3	7	5	20600


> New Y[]: 
	
	 0  0  1  1  0  1  2  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 88 #######################


> Neighbours evaluated; 21
> Selected Move:	2722	4	6	3	21200


> New Y[]: 
	
	 0  0  1  2  0  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 89 #######################


> Neighbours evaluated; 21
> Selected Move:	2819	3	5	7	20700


> New Y[]: 
	
	 0  0  1  2  0  0  1  1  3  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 90 #######################


> Neighbours evaluated; 26
> Selected Move:	2715	4	3	8	21100


> New Y[]: 
	
	 0  0  1  3  0  0  1  1  2  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 91 #######################


> Neighbours evaluated; 19
> Selected Move:	2888	4	8	7	20400


> New Y[]: 
	
	 0  0  1  3  0  0  1  2  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 92 #######################


> Neighbours evaluated; 20
> Selected Move:	2854	3	7	5	20600


> New Y[]: 
	
	 0  0  1  3  0  2  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,265

## ITERATION 93 #######################


> Neighbours evaluated; 22
> Selected Move:	2692	4	5	2	21200


> New Y[]: 
	
	 0  0  2  3  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 94 #######################


> Neighbours evaluated; 18
> Selected Move:	2870	3	2	0	19700


> New Y[]: 
	
	 2  0  0  3  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 95 #######################


> Neighbours evaluated; 27
> Selected Move:	2870	4	3	5	19700


> New Y[]: 
	
	 2  0  0  1  0  3  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 96 #######################


> Neighbours evaluated; 24
> Selected Move:	2870	4	5	6	19800


> New Y[]: 
	
	 2  0  0  1  0  1  3  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 97 #######################


> Neighbours evaluated; 24
> Selected Move:	2870	3	5	7	19300


> New Y[]: 
	
	 2  0  0  1  0  0  3  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 98 #######################


> Neighbours evaluated; 31
> Selected Move:	2870	4	6	3	19200


> New Y[]: 
	
	 2  0  0  3  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,295

## ITERATION 99 #######################


> Neighbours evaluated; 30
> Selected Move:	2870	4	3	7	19500


> New Y[]: 
	
	 2  0  0  1  0  0  1  3  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,29

## ITERATION 100 #######################


> Neighbours evaluated; 29
> Selected Move:	2783	4	7	8	20300


> New Y[]: 
	
	 2  0  0  1  0  0  1  1  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,285

## ITERATION 101 #######################


> Neighbours evaluated; 27
> Selected Move:	2860	3	7	9	21300


> New Y[]: 
	
	 2  0  0  1  0  0  1  0  3  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,28

## ITERATION 102 #######################


> Neighbours evaluated; 27
> Selected Move:	2646	3	9	5	20800


> New Y[]: 
	
	 2  0  0  1  0  1  1  0  3  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,275

## ITERATION 103 #######################


> Neighbours evaluated; 24
> Selected Move:	2528	3	8	4	21500


> New Y[]: 
	
	 2  0  0  1  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 104 #######################


> Neighbours evaluated; 26
> Selected Move:	3030	3	5	2	20000


> New Y[]: 
	
	 2  0  1  1  3  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 105 #######################


> Neighbours evaluated; 28
> Selected Move:	3030	4	4	3	19700


> New Y[]: 
	
	 2  0  1  3  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 106 #######################


> Neighbours evaluated; 30
> Selected Move:	3030	4	3	6	19800


> New Y[]: 
	
	 2  0  1  1  1  0  3  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 107 #######################


> Neighbours evaluated; 29
> Selected Move:	2940	3	6	8	19300


> New Y[]: 
	
	 2  0  1  1  1  0  0  0  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 108 #######################


> Neighbours evaluated; 30
> Selected Move:	2940	4	8	3	18200


> New Y[]: 
	
	 2  0  1  3  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 109 #######################


> Neighbours evaluated; 30
> Selected Move:	2940	4	3	4	18500


> New Y[]: 
	
	 2  0  1  1  3  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 110 #######################


> Neighbours evaluated; 28
> Selected Move:	2844	4	4	2	20400


> New Y[]: 
	
	 2  0  3  1  1  0  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 111 #######################


> Neighbours evaluated; 28
> Selected Move:	2940	3	2	9	19800


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,23

## ITERATION 112 #######################


> Neighbours evaluated; 32
> Selected Move:	2894	4	9	3	20200


> New Y[]: 
	
	 2  0  0  3  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,225

## ITERATION 113 #######################


> Neighbours evaluated; 31
> Selected Move:	2828	4	3	4	20500


> New Y[]: 
	
	 2  0  0  1  3  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 114 #######################


> Neighbours evaluated; 29
> Selected Move:	2654	4	4	8	21300


> New Y[]: 
	
	 2  0  0  1  1  0  0  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 115 #######################


> Neighbours evaluated; 29
> Selected Move:	2643	3	8	6	21800


> New Y[]: 
	
	 2  0  0  1  1  0  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 116 #######################


> Neighbours evaluated; 27
> Selected Move:	2834	3	9	7	20800


> New Y[]: 
	
	 2  0  0  1  1  0  3  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 117 #######################


> Neighbours evaluated; 27
> Selected Move:	2853	4	6	3	20700


> New Y[]: 
	
	 2  0  0  3  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 118 #######################


> Neighbours evaluated; 29
> Selected Move:	2780	4	3	4	21000


> New Y[]: 
	
	 2  0  0  1  3  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 119 #######################


> Neighbours evaluated; 25
> Selected Move:	2775	4	4	7	21000


> New Y[]: 
	
	 2  0  0  1  1  0  1  3  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 120 #######################


> Neighbours evaluated; 28
> Selected Move:	2718	3	7	9	21300


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 121 #######################


> Neighbours evaluated; 28
> Selected Move:	2700	3	9	1	19500


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 122 #######################


> Neighbours evaluated; 30
> Selected Move:	2910	1	-1	2	24000


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 123 #######################


> Neighbours evaluated; 30
> Selected Move:	3233	3	4	8	22500


> New Y[]: 
	
	 2  3  1  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 124 #######################


> Neighbours evaluated; 32
> Selected Move:	2900	3	6	4	22500


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 125 #######################


> Neighbours evaluated; 33
> Selected Move:	2833	3	4	7	21500


> New Y[]: 
	
	 2  3  1  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 126 #######################


> Neighbours evaluated; 32
> Selected Move:	2870	2	2	-1	17000


> New Y[]: 
	
	 2  3  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 127 #######################


> Neighbours evaluated; 31
> Selected Move:	2660	3	0	6	18800


> New Y[]: 
	
	 0  3  0  1  0  0  2  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 128 #######################


> Neighbours evaluated; 27
> Selected Move:	2822	3	1	9	20600


> New Y[]: 
	
	 0  0  0  1  0  0  2  1  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 129 #######################


> Neighbours evaluated; 22
> Selected Move:	2820	3	7	2	19600


> New Y[]: 
	
	 0  0  1  1  0  0  2  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,29

## ITERATION 130 #######################


> Neighbours evaluated; 26
> Selected Move:	2820	4	9	3	20000


> New Y[]: 
	
	 0  0  1  3  0  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,295

## ITERATION 131 #######################


> Neighbours evaluated; 23
> Selected Move:	2820	3	6	4	20000


> New Y[]: 
	
	 0  0  1  3  2  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,3

## ITERATION 132 #######################


> Neighbours evaluated; 25
> Selected Move:	2820	4	3	9	19600


> New Y[]: 
	
	 0  0  1  1  2  0  0  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,295

## ITERATION 133 #######################


> Neighbours evaluated; 27
> Selected Move:	2761	4	4	3	20200


> New Y[]: 
	
	 0  0  1  2  1  0  0  0  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 134 #######################


> Neighbours evaluated; 27
> Selected Move:	2762	3	4	6	20200


> New Y[]: 
	
	 0  0  1  2  0  0  1  0  1  3 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,285

## ITERATION 135 #######################


> Neighbours evaluated; 27
> Selected Move:	2678	4	3	9	20500


> New Y[]: 
	
	 0  0  1  3  0  0  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,28

## ITERATION 136 #######################


> Neighbours evaluated; 25
> Selected Move:	2680	3	6	4	20500


> New Y[]: 
	
	 0  0  1  3  1  0  0  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,285

## ITERATION 137 #######################


> Neighbours evaluated; 24
> Selected Move:	2592	4	3	4	20800


> New Y[]: 
	
	 0  0  1  1  3  0  0  0  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,29

## ITERATION 138 #######################


> Neighbours evaluated; 23
> Selected Move:	2646	3	4	6	20600


> New Y[]: 
	
	 0  0  1  1  0  0  3  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,295

## ITERATION 139 #######################


> Neighbours evaluated; 22
> Selected Move:	2614	4	9	3	20700


> New Y[]: 
	
	 0  0  1  2  0  0  3  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  1  0  1  0 
 > pw :0,3

## ITERATION 140 #######################


> Neighbours evaluated; 23
> Selected Move:	2550	3	6	4	20900


> New Y[]: 
	
	 0  0  1  2  3  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  1  0 
 > pw :0,305

## ITERATION 141 #######################


> Neighbours evaluated; 22
> Selected Move:	2490	3	9	7	19900


> New Y[]: 
	
	 0  0  1  2  3  0  0  1  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 142 #######################


> Neighbours evaluated; 25
> Selected Move:	2576	3	8	6	21400


> New Y[]: 
	
	 0  0  1  2  3  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 143 #######################


> Neighbours evaluated; 19
> Selected Move:	2632	4	4	6	21200


> New Y[]: 
	
	 0  0  1  2  1  0  3  1  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 144 #######################


> Neighbours evaluated; 21
> Selected Move:	2562	4	6	7	21400


> New Y[]: 
	
	 0  0  1  2  1  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 145 #######################


> Neighbours evaluated; 20
> Selected Move:	2750	4	3	4	20800


> New Y[]: 
	
	 0  0  1  1  2  0  1  3  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 146 #######################


> Neighbours evaluated; 24
> Selected Move:	2700	3	7	1	19300


> New Y[]: 
	
	 0  3  1  1  2  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 147 #######################


> Neighbours evaluated; 25
> Selected Move:	2700	4	4	3	19900


> New Y[]: 
	
	 0  3  1  2  1  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 148 #######################


> Neighbours evaluated; 25
> Selected Move:	2700	3	3	0	17500


> New Y[]: 
	
	 2  3  1  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 149 #######################


> Neighbours evaluated; 33
> Selected Move:	2700	3	0	5	19900


> New Y[]: 
	
	 0  3  1  0  1  2  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,35

## ITERATION 150 #######################


> Neighbours evaluated; 22
> Selected Move:	2700	4	5	4	18800


> New Y[]: 
	
	 0  3  1  0  2  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,345

## ITERATION 151 #######################


> Neighbours evaluated; 26
> Selected Move:	2700	4	4	6	18800


> New Y[]: 
	
	 0  3  1  0  1  1  2  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,34

## ITERATION 152 #######################


> Neighbours evaluated; 26
> Selected Move:	2700	3	2	7	19800


> New Y[]: 
	
	 0  3  0  0  1  1  2  1  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  0  1  0  0 
 > pw :0,335

## ITERATION 153 #######################


> Neighbours evaluated; 21
> Selected Move:	2770	3	4	3	19800


> New Y[]: 
	
	 0  3  0  1  0  1  2  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,33

## ITERATION 154 #######################


> Neighbours evaluated; 25
> Selected Move:	2776	3	7	9	20800


> New Y[]: 
	
	 0  3  0  1  0  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,325

## ITERATION 155 #######################


> Neighbours evaluated; 26
> Selected Move:	2660	3	3	8	19300


> New Y[]: 
	
	 0  3  0  0  0  1  2  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,32

## ITERATION 156 #######################


> Neighbours evaluated; 29
> Selected Move:	2660	4	6	9	19800


> New Y[]: 
	
	 0  3  0  0  0  1  1  0  1  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,315

## ITERATION 157 #######################


> Neighbours evaluated; 27
> Selected Move:	2660	3	5	2	18300


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  1  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 158 #######################


> Neighbours evaluated; 28
> Selected Move:	2660	4	9	2	19500


> New Y[]: 
	
	 0  3  2  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 159 #######################


> Neighbours evaluated; 30
> Selected Move:	2660	4	2	6	17800


> New Y[]: 
	
	 0  3  1  0  0  0  2  0  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 160 #######################


> Neighbours evaluated; 27
> Selected Move:	2660	4	6	8	19900


> New Y[]: 
	
	 0  3  1  0  0  0  1  0  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 161 #######################


> Neighbours evaluated; 24
> Selected Move:	2660	3	9	3	19900


> New Y[]: 
	
	 0  3  1  1  0  0  1  0  2  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 162 #######################


> Neighbours evaluated; 25
> Selected Move:	2660	4	8	2	19500


> New Y[]: 
	
	 0  3  2  1  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 163 #######################


> Neighbours evaluated; 28
> Selected Move:	2705	3	1	7	21000


> New Y[]: 
	
	 0  0  2  1  0  0  1  3  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 164 #######################


> Neighbours evaluated; 22
> Selected Move:	2794	4	7	3	20700


> New Y[]: 
	
	 0  0  2  3  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 165 #######################


> Neighbours evaluated; 23
> Selected Move:	2770	4	3	6	20800


> New Y[]: 
	
	 0  0  2  1  0  0  3  1  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 166 #######################


> Neighbours evaluated; 25
> Selected Move:	2666	4	2	6	21200


> New Y[]: 
	
	 0  0  3  1  0  0  2  1  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 167 #######################


> Neighbours evaluated; 24
> Selected Move:	2560	3	7	5	21700


> New Y[]: 
	
	 0  0  3  1  0  1  2  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,27

## ITERATION 168 #######################


> Neighbours evaluated; 17
> Selected Move:	2660	3	2	1	19300


> New Y[]: 
	
	 0  3  0  1  0  1  2  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,275

## ITERATION 169 #######################


> Neighbours evaluated; 26
> Selected Move:	2660	4	6	3	19900


> New Y[]: 
	
	 0  3  0  2  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,28

## ITERATION 170 #######################


> Neighbours evaluated; 28
> Selected Move:	2660	3	3	0	17500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,285

## ITERATION 171 #######################


> Neighbours evaluated; 30
> Selected Move:	2700	3	8	4	19000


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,29

## ITERATION 172 #######################


> Neighbours evaluated; 32
> Selected Move:	2700	3	5	7	18500


> New Y[]: 
	
	 2  3  0  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  1  0  0 
 > pw :0,295

## ITERATION 173 #######################


> Neighbours evaluated; 30
> Selected Move:	2700	3	0	2	20000


> New Y[]: 
	
	 0  3  2  0  1  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,29

## ITERATION 174 #######################


> Neighbours evaluated; 27
> Selected Move:	2700	4	2	4	18300


> New Y[]: 
	
	 0  3  1  0  2  0  1  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,285

## ITERATION 175 #######################


> Neighbours evaluated; 25
> Selected Move:	2700	4	4	6	18300


> New Y[]: 
	
	 0  3  1  0  1  0  2  1  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,28

## ITERATION 176 #######################


> Neighbours evaluated; 23
> Selected Move:	2700	4	6	7	19700


> New Y[]: 
	
	 0  3  1  0  1  0  1  2  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,275

## ITERATION 177 #######################


> Neighbours evaluated; 22
> Selected Move:	2660	3	4	8	18200


> New Y[]: 
	
	 0  3  1  0  0  0  1  2  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,27

## ITERATION 178 #######################


> Neighbours evaluated; 28
> Selected Move:	2660	4	7	2	18500


> New Y[]: 
	
	 0  3  2  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,265

## ITERATION 179 #######################


> Neighbours evaluated; 28
> Selected Move:	2660	4	2	6	16800


> New Y[]: 
	
	 0  3  1  0  0  0  2  1  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,26

## ITERATION 180 #######################


> Neighbours evaluated; 26
> Selected Move:	2660	4	6	8	18900


> New Y[]: 
	
	 0  3  1  0  0  0  1  1  2  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,255

## ITERATION 181 #######################


> Neighbours evaluated; 25
> Selected Move:	2660	3	7	5	19400


> New Y[]: 
	
	 0  3  1  0  0  1  1  0  2  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,25

## ITERATION 182 #######################


> Neighbours evaluated; 24
> Selected Move:	2660	4	8	2	19000


> New Y[]: 
	
	 0  3  2  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,245

## ITERATION 183 #######################


> Neighbours evaluated; 23
> Selected Move:	2660	4	2	5	18400


> New Y[]: 
	
	 0  3  1  0  0  2  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,24

## ITERATION 184 #######################


> Neighbours evaluated; 25
> Selected Move:	2660	4	5	6	17300


> New Y[]: 
	
	 0  3  1  0  0  1  2  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,235

## ITERATION 185 #######################


> Neighbours evaluated; 22
> Selected Move:	2660	3	5	3	17800


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 186 #######################


> Neighbours evaluated; 17
> Selected Move:	2711	1	-1	9	24300


> New Y[]: 
	
	 0  3  1  1  0  0  2  0  1  1 


> New S[]: 
	
	 0  0  0  1  0  0  1  0  0  0 
 > pw :0,225

## ITERATION 187 #######################


> Neighbours evaluated; 29
> Selected Move:	2668	3	6	0	22500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 188 #######################


> Neighbours evaluated; 31
> Selected Move:	2880	3	2	6	24500


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 189 #######################


> Neighbours evaluated; 32
> Selected Move:	2693	3	3	2	22500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,21

## ITERATION 190 #######################


> Neighbours evaluated; 31
> Selected Move:	2915	3	9	7	21500


> New Y[]: 
	
	 2  3  1  0  0  0  1  1  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 191 #######################


> Neighbours evaluated; 31
> Selected Move:	2885	3	8	3	23000


> New Y[]: 
	
	 2  3  1  1  0  0  1  1  0  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 192 #######################


> Neighbours evaluated; 29
> Selected Move:	2870	3	6	4	23000


> New Y[]: 
	
	 2  3  1  1  1  0  0  1  0  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 193 #######################


> Neighbours evaluated; 31
> Selected Move:	2795	3	3	6	23000


> New Y[]: 
	
	 2  3  1  0  1  0  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 194 #######################


> Neighbours evaluated; 28
> Selected Move:	2765	3	6	8	21500


> New Y[]: 
	
	 2  3  1  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 195 #######################


> Neighbours evaluated; 33
> Selected Move:	2720	3	7	5	22000


> New Y[]: 
	
	 2  3  1  0  1  1  0  0  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 196 #######################


> Neighbours evaluated; 35
> Selected Move:	2750	3	4	3	22000


> New Y[]: 
	
	 2  3  1  1  0  1  0  0  1  0 


> New S[]: 
	
	 0  1  0  1  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 197 #######################


> Neighbours evaluated; 26
> Selected Move:	2740	3	3	6	22000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  0 


> New S[]: 
	
	 0  1  0  0  0  0  1  0  0  0 
 > pw :0,25

## ITERATION 198 #######################


> Neighbours evaluated; 23
> Selected Move:	2660	2	5	-1	16000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 199 #######################


> Neighbours evaluated; 24
> Selected Move:	2660	3	0	3	18400


> New Y[]: 
	
	 0  3  1  2  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  1  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 200 #######################


> Neighbours evaluated; 17
> Selected Move:	2660	3	2	7	19400


> New Y[]: 
	
	 0  3  0  2  0  0  1  1  1  0 


> New S[]: 
	
	 0  0  0  1  0  0  0  1  0  0 
 > pw :0,265

## ITERATION 201 #######################


> Neighbours evaluated; 25
> Selected Move:	2672	3	1	9	21200


> New Y[]: 
	
	 0  0  0  2  0  0  1  1  1  3 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 202 #######################


> Neighbours evaluated; 22
> Selected Move:	2585	4	3	9	21500


> New Y[]: 
	
	 0  0  0  3  0  0  1  1  1  2 


> New S[]: 
	
	 0  0  0  1  0  0  0  0  0  1 
 > pw :0,275
________________________________________________________________

Best solution found: 3400
Run Termination time: 31.01.2010 10:22:15
Run duration: 00:00:55.6406250
________________________________________________________________
